Polytopes determined by complementfree Sperner families

نویسندگان

  • Konrad Engel
  • Péter L. Erdös
چکیده

LetN={l,..., n} and (7) = {Xc N: 1X(= i}. If 9 is a family of subsets of N, then let 5$ = {X E 9: 1x1 = i} and A = 141, i = 0, . . . , n. The vector f = &.*-7.L) is called the profile of 9. If A is a class of families, let p(A) be the set of profiles of the families belonging to A, (p(A)) be its convex hull in the space [Wn+l and E(A) be the set of all extreme points (i.e. vertices) of the polytope (p(A)). This subject was first studied by P.L. Erdiis, P. Frank1 and G.O.H. Katona who determined E(A) for some special classes [4]. The determination of E(A) is motivated by the following fact: If w is any (weight-)function from (0, . . . , n} into [w, then

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Linear Chromatic Number of Sperner Families

Let S be a set with m elements and S a complete Sperner family on S, i.e. a Sperner family such that every x ∈ S is contained in some member of S. The linear chromatic number of S, defined by Civan, is the smallest integer n with the property that there exists a function f : S → {1, . . . , n} such that if f(x) = f(y), then every set in S which contains x also contains y, or every set in S whic...

متن کامل

A classification of the structures of some Sperner families and superimposed codes

In this paper we will give a new proof by using group action to prove the uniqueness of maximal Sperner familiesFmax of [n].We will also prove the uniqueness of Sperner familiesF of [n]with |F|= ( n n2 ) −1 by using a combinatorial approach. Furthermore, by using the uniqueness of Sperner family, we will classify all the structures of (1, 2) superimposed codes of size 9× 10 and 9× 11. © 2006 El...

متن کامل

Convex hulls of more-part Sperner families

The convex hulls of more-part Sperner families is defined and studied. Corollaries of the results are some well-known theorems on 2 or 3-part Sperner families. Some methods are presented giving new theorems.

متن کامل

Sperner families satisfying additional conditions and their convex hulls

The profile of a hypergraph on n vertices is (f0 ..... fn) where fi denotes the number of /-element edges. The extreme points of the set of the profiles are determined for Sperner hyper-graphs satisfying some additional conditions. The results contain some old theorems of extremal set theory as particular cases.

متن کامل

The linear chromatic number of a Sperner family

Let S be a finite set and S a complete Sperner family on S, i.e. a Sperner family such that every x ∈ S is contained in some member of S. The linear chromatic number of S, defined by Cıvan, is the smallest integer n with the property that there exists a function f : S → {1, . . . , n} such that if f(x) = f(y), then every set in S which contains x also contains y or every set in S which contains...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 81  شماره 

صفحات  -

تاریخ انتشار 1990